Nearly perfect codes in distance-regular graphs
نویسندگان
چکیده
منابع مشابه
Codes in Bipartite Distance^regular Graphs
For each bipartition_of a bipartite distance-regular graph F, there naturally corresponds another distance-regular graph F called a halved graph. It is shown that the existence of a perfect e-code in a halved graph F is equivalent to the existence of a uniformly packed 2e-code in F with certain specific parameters. Using this equivalence, we show the non-existence of perfect codes for two class...
متن کاملNearly perfect sets in graphs
In a graph G = (V; E), a set of vertices S is nearly perfect if every vertex in V ? S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and eecient dominating sets. We say a nearly perfect set S is 1-minimal if for every vertex u in S, the set S ? fug is not nearly perfect. Similarly, a nearly perfect s...
متن کاملFamilies of nested completely regular codes and distance-regular graphs
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius ρ equal to 3 or 4, and are 1/2-th parts, for i ∈ {1, . . . , u} of binary (respectively, extended binary) Hamming codes of length n = 2 − 1 (respectively, 2), where m = 2u. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs...
متن کاملOn nested completely regular codes and distance regular graphs
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
متن کاملNearly perfect matchings in regular simple hypergraphs
For every fixed k ≥ 3 there exists a constant ck with the following property. Let H be a kuniform, D-regular hypergraph on N vertices, in which no two edges contain more than one common vertex. If k > 3 then H contains a matching covering all vertices but at most ckND. If k = 3, then H contains a matching covering all vertices but at most c3ND lnD. This improves previous estimates and implies, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1976
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90004-2